Iterative convergence of passage-time densities in semi-Markov performance models

نویسندگان

  • Jeremy T. Bradley
  • Helen J. Wilson
چکیده

Passage-time densities are important for the detailed performance analysis of distributed computer and communicating systems. We provide a proof and demonstration of a practical iterative algorithm for extracting complete passage-time densities from expressive semi-Markov systems. We end by showing its application to a distributed web-server cluster model of 15.9 million states.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models

Passage time densities and quantiles are important performance and quality of service metrics, but their numerical derivation is, in general, computationally expensive. We present an iterative algorithm for the calculation of passage time densities in semi-Markov models, along with a theoretical analysis and empirical measurement of its convergence behaviour. In order to implement the algorithm...

متن کامل

Derivation of Passage-time Densities in PEPA Models using ipc: the Imperial PEPA Compiler

We present a technique for defining and extracting passage-time densities from high-level stochastic process algebra models. Our high-level formalism is PEPA, a popular Markovian process algebra for expressing compositional performance models. We introduce ipc, a tool which can process PEPA-specified passage-time densities and models, by compiling the PEPA model and passage specification into t...

متن کامل

Truncation of Passage Time Calculations in Semi-Markov Models

Calculation of passage time distributions in large semi-Markov models can be accomplished by means of a previously-presented iterative algorithm, the core of which is repeated sparse matrix–vector multiplication. The algorithm’s performance is therefore highly dependent on the number of multiplications of matrix and vector elements that must be performed during each iteration. At the same time,...

متن کامل

Aggregation and Numerical Techniques for Passage Time Calculations in Large semi-Markov Models

First-passage time densities and quantiles are important metrics in performance analysis. They are used in the analysis of mobile communication systems, web servers, manufacturing systems as well as for the analysis of the quality of service of hospitals and government organisations. In this report we look at computational techniques for the first-passage time analysis on highlevel models that ...

متن کامل

Truncation of Passage Time Calculations in Large Semi-Markov Models

Calculation of passage time distributions in large semi-Markov models can be accomplished by means of a previously-presented iterative algorithm, the core of which is repeated sparse matrix–vector multiplication. The algorithm’s performance is therefore highly dependent on the number of multiplications of matrix and vector elements that must be performed during each iteration. At the same time,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Perform. Eval.

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2005